Approximations of

Results: 293



#Item
41APPROXIMATIONS OF CONVEX BODIES BY POLYTOPES AND BY PROJECTIONS OF SPECTRAHEDRA Alexander Barvinok April 2012 Abstract. We prove that for any compact set B ⊂ Rd and for any ǫ > 0 there is a

APPROXIMATIONS OF CONVEX BODIES BY POLYTOPES AND BY PROJECTIONS OF SPECTRAHEDRA Alexander Barvinok April 2012 Abstract. We prove that for any compact set B ⊂ Rd and for any ǫ > 0 there is a

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2012-04-12 09:41:32
42INVESTIGATION OF 3He(p, 2p)d REACTION IN T-MATRIX AND DIFFRACTION APPROXIMATIONS AT INTERMEDIATE ENERGIES V. V. Davydovskyy, A. D. Foursat In the framework of Т-matrix approximation with distorted waves, as well as with

INVESTIGATION OF 3He(p, 2p)d REACTION IN T-MATRIX AND DIFFRACTION APPROXIMATIONS AT INTERMEDIATE ENERGIES V. V. Davydovskyy, A. D. Foursat In the framework of Т-matrix approximation with distorted waves, as well as with

Add to Reading List

Source URL: jnpae.kinr.kiev.ua

Language: English - Date: 2011-04-23 09:25:48
    43Stochastic Methods for Finite Approximations in a non-Archimedean Setting Trond Digernes1 Joint work with Erik M. Bakken1 and David Weisbart2 1 Department of Mathematical Sciences The Norwegian University of Science and

    Stochastic Methods for Finite Approximations in a non-Archimedean Setting Trond Digernes1 Joint work with Erik M. Bakken1 and David Weisbart2 1 Department of Mathematical Sciences The Norwegian University of Science and

    Add to Reading List

    Source URL: p-adics2015.matf.bg.ac.rs

    Language: English - Date: 2015-09-25 04:52:21
      44Optimal rates for random Fourier feature kernel approximations∗ Zolt´an Szab´o (Gatsby Unit, University College London)†  Abstract: Kernel methods represent one of the most powerful tools in machine learning to tac

      Optimal rates for random Fourier feature kernel approximations∗ Zolt´an Szab´o (Gatsby Unit, University College London)† Abstract: Kernel methods represent one of the most powerful tools in machine learning to tac

      Add to Reading List

      Source URL: www.gatsby.ucl.ac.uk

      Language: English - Date: 2015-11-10 17:13:11
        45Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling Peter Hooper Yasin Abbasi-Yadkori, Russ Greiner, Bret Hoehn Dept of Mathematical & Statistical Sciences

        Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling Peter Hooper Yasin Abbasi-Yadkori, Russ Greiner, Bret Hoehn Dept of Mathematical & Statistical Sciences

        Add to Reading List

        Source URL: webdocs.cs.ualberta.ca

        Language: English - Date: 2009-08-28 21:02:53
          46Training Restricted Boltzmann Machines using Approximations to the Likelihood Gradient Tijmen Tieleman  Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada

          Training Restricted Boltzmann Machines using Approximations to the Likelihood Gradient Tijmen Tieleman Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada

          Add to Reading List

          Source URL: www.cs.utoronto.ca

          Language: English - Date: 2008-05-10 10:14:44
            47Introduction Variational Approximations On the Properties of Variational Approximations in Statistical Learning. Pierre Alquier

            Introduction Variational Approximations On the Properties of Variational Approximations in Statistical Learning. Pierre Alquier

            Add to Reading List

            Source URL: alquier.ensae.net

            Language: English - Date: 2015-10-28 13:21:57
              48MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 2010

              MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 2010

              Add to Reading List

              Source URL: www.math.lsa.umich.edu

              Language: English - Date: 2010-01-19 13:40:01
              49First version: December 17, 1996 Revised version: May 26, 1998 EXPONENTIAL APPROXIMATIONS IN COMPLETELY REGULAR TOPOLOGICAL SPACES AND EXTENSIONS OF SANOV’S THEOREM

              First version: December 17, 1996 Revised version: May 26, 1998 EXPONENTIAL APPROXIMATIONS IN COMPLETELY REGULAR TOPOLOGICAL SPACES AND EXTENSIONS OF SANOV’S THEOREM

              Add to Reading List

              Source URL: www.fam.tuwien.ac.at

              Language: English - Date: 2003-06-14 17:13:18
                50Optimal rates for random Fourier feature approximations∗ Zolt´an Szab´o (Gatsby Unit, University College London)†  Abstract: Kernel methods represent one of the most powerful tools in machine learning to tackle

                Optimal rates for random Fourier feature approximations∗ Zolt´an Szab´o (Gatsby Unit, University College London)† Abstract: Kernel methods represent one of the most powerful tools in machine learning to tackle

                Add to Reading List

                Source URL: www.gatsby.ucl.ac.uk

                Language: English - Date: 2015-12-12 19:01:38